منابع مشابه
Definable Λp-regular cell decomposition
We show that every definable subset of an o-minimal structure expanding an arbitrary real closed field can be decomposed into finitely many definable cells of certain regularity i.e. up to a given order, the derivatives of the functions, defining the cells, have controllable behaviour at the boundary of their domain. In [7] there is a proof of a subanalytic version of Whitney’s extension theore...
متن کاملAnalysis of the Λp Final State Interaction in the Reaction p + p → K + ( Λp )
The missing mass spectrum measured in high resolution studies of the reaction pp → K + X is analyzed with respect to the strong final state interaction near the Λp production threshold. The observed spectrum can be described by factorizing the reaction amplitude in terms of a production amplitude and a final state scattering amplitude. Parametrizing the Λp final state interaction in terms of th...
متن کاملSome remarks on λp,q-connectedness
A connected graph is λp,q-connected if there is a set of edges whose deletion leaves two components of order at least p and q, respectively. In this paper we present some sufficient conditions for graphs to be λp,q-connected. Furthermore, we study λ2,qconnected graphs in more detail.
متن کاملSOME NORMAL SUBGROUPS OF THE EXTENDED HECKE GROUPS H(λp)
We consider the extended Hecke groupsH(λp) generated by T (z) = −1/z, S(z) = −1/(z+λp) and R(z) = 1/ z̄ with λp = 2 cos(π/p) for p ≥ 3 prime number. In this article, we study the abstract group structure of the extended Hecke groups and the power subgroups H m (λp) of H(λp). Then, we give the relations between commutator subgroups and power subgroups and also the information of interest about fr...
متن کاملOn the π-calculus and Co-intuitionistic Logic. Notes on Logic for Concurrency and λP Systems
We reconsider work by Bellin and Scott in the 1990s on R. Milner and S. Abramsky’s encoding of linear logic in the π-calculus and give an account of efforts to establish a tight connection between the structure of proofs and of the cut elimination process in multiplicative linear logic, on one hand, and the input-output behaviour of the processes that represent them, on the other, resulting in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2014
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2014.02.011